Newton-like methods under mild differentiability conditions with error analysis
نویسندگان
چکیده
منابع مشابه
On the R-order of convergence of Newton’s method under mild differentiability conditions
A new technique is used instead of the classical majorant principle to analyze the R-order of convergence of the Newton process when more general conditions than the Kantorovich ones are considered. © 2005 Elsevier B.V. All rights reserved. MSC: 47H17; 65J15
متن کاملLocal convergence analysis of inexact Newton-like methods under majorant condition
We provide a local convergence analysis of inexact Newton–like methods in a Banach space setting under flexible majorant conditions. By introducing center–Lipschitz–type condition, we provide (under the same computational cost) a convergence analysis with the following advantages over earlier work [9]: finer error bounds on the distances involved, and a larger radius of convergence. Special cas...
متن کاملNewton-Like Methods for Nonparametric Independent Component Analysis
The performance of ICA algorithms significantly depends on the choice of the contrast function and the optimisation algorithm used in obtaining the demixing matrix. In this paper we focus on the standard linear nonparametric ICA problem from an optimisation point of view. It is well known that after a pre-whitening process, the problem can be solved via an optimisation approach on a suitable ma...
متن کاملKarush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods
We consider optimality systems of Karush-Kuhn-Tucker (KKT) type, which arise, for example, as primal-dual conditions characterizing solutions of optimization problems or variational inequalities. In particular, we discuss error bounds and Newton-type methods for such systems. An exhaustive comparison of various regularity conditions which arise in this context is given. We obtain a new error bo...
متن کاملChemical Process Optimization Using Newton-like Methods
Various interrelated issues that effect the reliability and efficiency of Newton-like methods for chemical process optimization are studied. An algorithm for solving large, sparse quadratic programming (QP) problems that is based on an active set strategy and a symmetric, indefinite factorization is presented. The QP algorithm is fast and reliable. A simple asymmetric trust region method is pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1988
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700004238